Four-Fold Formal Concept Analysis Based on Complete Idempotent Semifields

نویسندگان

چکیده

Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lattice and Order Theory, that has several extensions to, e.g., fuzzy idempotent semirings. At the heart of FCA lies Galois connection between two powersets. In this paper we extend formalism to include all four connections different semivectors spaces over semifields, at same time. The result K¯-four-fold (K¯-4FCA) where K¯ semifield biasing analysis. Since complete semifields come dually-ordered pairs—e.g., max-plus min-plus semirings—the basic construction shows dual-order-, row–column- Galois-connection-induced dualities appear simultaneously number times provide full spectrum variability. Our results lead fundamental theorem properly defines quadrilattices as 4-tuples (order-dually) isomorphic lattices vectors discuss its relevance vis-à-vis previous formal conceptual analyses some affordances their results.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ranking Ontologies Based on Formal Concept Analysis

Ontology ranking is one of the important functions of ontology search engine and plays an important role for ontology reuse. It facilitates effectively user to choose the reusable ontologies from the search results returned by ontology search engine. The current ontology ranking methods can not satisfy user because of various defects. On the basis of analyzing the existing ontology ranking meth...

متن کامل

Fuzzy Concept Mining based on Formal Concept Analysis

Data Mining(also known as Knowledge Discovery) is defined as the non-trivial extraction of implicit, previously unknown, and potentially useful information from data. It includes not only methods for extracting information from the given data, but also visualizing the information. Formal Concept Analysis(FCA) is one of Data mining research fields, and it has been applied to a number of areas su...

متن کامل

Formal Concept Analysis Based Clustering

Formal concept analysis (FCA) is a branch of applied mathematics with roots in lattice theory (Wille, 1982; Ganter & Wille, 1999). It deals with the notion of a concept in a given universe, which it calls context. For example, consider the context of transactions at a grocery store where each transaction consists of the items bought together. A concept here is a pair of two sets (A, B). A is th...

متن کامل

Spectral Lattices of Reducible Matrices over Completed Idempotent Semifields

Previous work has shown a relation between L-valued extensions of FCA and the spectra of some matrices related to L-valued contexts. We investigate the spectra of reducible matrices over completed idempotent semifields in the framework of dioids, naturally-ordered semirings, that encompass several of those extensions. Considering special sets of eigenvectors also brings out complete lattices in...

متن کامل

Query-based Biclustering using Formal Concept Analysis

Biclustering methods have proven to be critical tools in the exploratory analysis of high-dimensional data including information networks, microarray experiments, and bag of words data. However, most biclustering methods fail to answer specific questions of interest and do not incorporate prior knowledge and expertise from the user. To this end, query-based biclustering algorithms that are rece...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9020173